Reciprocal best match graphs
نویسندگان
چکیده
منابع مشابه
Reciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملAccess to Legal Documents: Exact Match, Best Match, and Combinations
In this paper, we document our efforts in participating to the TREC 2007 Legal track. We had multiple aims: First, to experiment with using different query formulations, trying to exploit the verbose topic statements. Second, to analyse how ranked retrieval methods can be fruitfully combined with traditional Boolean queries. Our main findings can be summarized as follows: First, we got mixed re...
متن کاملBest-Match Retrieval for Structured Images
|This paper propose a new methodology for fast best-match retrieval of structured images. A triangle inequality property for the tree-distance introduced by O azer [IEEE Transactions on P.A.M.I., Vol. 19, No. 12, December 1997] is proved. This property is in turn applied to obtain a saturation algorithm of the trie used to store the database of the collection of pictures. The new approach can b...
متن کاملreciprocal degree distance of grassmann graphs
recently, hua et al. defined a new topological index based on degrees and inverse ofdistances between all pairs of vertices. they named this new graph invariant as reciprocaldegree distance as 1{ , } ( ) ( ( ) ( ))[ ( , )]rdd(g) = u v v g d u d v d u v , where the d(u,v) denotesthe distance between vertices u and v. in this paper, we compute this topological index forgrassmann graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Biology
سال: 2019
ISSN: 0303-6812,1432-1416
DOI: 10.1007/s00285-019-01444-2